Derandomization for Sliding Window Algorithms with Strict Correctness∗
نویسندگان
چکیده
منابع مشابه
Randomized sliding window algorithms for regular languages
A sliding window algorithm receives a stream of symbols and has to output at each time instant a certain value which only depends on the last $n$ symbols. If the algorithm is randomized, then at each time instant it produces an incorrect output with probability at most $\epsilon$, which is a constant error bound. This work proposes a more relaxed definition of correctness which is parameterized...
متن کاملA Note on Perfect Correctness by Derandomization
We show a general compiler that transforms a large class of erroneous cryptographic schemes (such as public-key encryption, indistinguishability obfuscation, and secure multiparty computation schemes) into perfectly correct ones. The transformation works for schemes that are correct on all inputs with probability noticeably larger than half, and are secure under parallel repetition. We assume t...
متن کاملNormalized Sliding Window Constant Modulus Algorithms for Blind Equalization
Cette communication pr esente une nouvelle classe d'algorithmes d' egalisation aveugle pour la transmission des donn ees MAP ou MAQ a travers un canal de communication a phase non-minimale. Cette classe d'algorithmes est deriv ee en minimisant un crit ere d eterministe qui impose un ensemble de contraintes bas ees sur la propriet e du module constant de la constellation emise et permet l'accel ...
متن کاملDerandomization of Genetic Algorithms
Even though genetic algorithms have been successfully used in many application domains, current theory has indicated several performance problems. The no-free-lunch theorem suggests that due to resampling of already visited points, genetic algorithms do not yield optimal average performance. Consequently, this paper suggests a derandomization scheme, which strictly improves genetic algorithm pe...
متن کاملSliding window adaptive fast QR and QR-lattice algorithms
Sliding window formulations of the fast QR and fast QR-lattice algorithms are presented. The derivations are based on the partial triangularization of raw data matrices. Three methods for window downdating are discussed: the method of plane hyperbolic rotations, the Chambers’ method, and the LINPACK algorithm. A numerically ill-conditioned stationary signal and a speech signal are used in finit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2020
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-020-10000-1